Higher order hypergeometric Lauricella function and zero asymptotics of orthogonal polynomials

The asymptotic contracted measure of zeros of a large class of orthogonal polynomials is explicitly given in the form of a Lauricella function. The polynomials are defined by means of a three-term recurrence relation whose coefficients may be unbounded but vary regularly and have a different behaviour for even and odd indices. Subclasses of systems of orthogonal polynomials having their contracted measure of zeros of regular, uniform, Wigner, Weyl, Karamata and hypergeometric types are explicitly identified. Some illustrative examples are given

Railway Rapid Transit timetables with variable and elastic demand.

This paper focuses on the design of railway timetables considering a variable elastic demand profile along a whole design day. Timetabling is the third stage in the classical hierarchical railway planning process. Most of previous works on this topic consider a uniform demand behavior for short planning intervals. In this paper, we propose a MINLP model for designing non-periodic timetables on a railway corridor where demand is dependent on waiting times. In the elastic demand case, long waiting times lead to a loss of passengers, who may select an alternative transportation mode. The mode choice is modeled using two alternative methods. The first one is based on a sigmoid function and can be used in case of absence of information for competitor modes. In the second one, the mode choice probability is obtained using a Logit model that explicitly considers the existence of a main alternative mode. With the purpose of obtaining optimal departure times, in both cases, a minimization of the loss of passengers is used as objective function. Finally, as illustration, the timetabling MINLP model with both mode choice methods is applied to a real case and computational results are shown

Fisher information of special functions and second-order differential equations

We investigate a basic question of information theory, namely the evaluation of the Fisher information and the relative Fisher information with respect to a nonnegative function, for the probability distributions obtained by squaring the special functions of mathematical physics which are solutions of second-order differential equations. Emphasis is made in the Nikiforov-Uvarov hypergeometric-type functions. We obtain explicit expressions for these information-theoretic properties via the expectation values of the coefficients of the differential equation. We illustrate our approach for various special functions of physico-mathematical interest

Comparative analysis of some modeal reconstruction methods of the cornea from corneal elevation data

Purpose. A comparative study of the ability of some modal schemes to reproduce corneal shapes of varying complexity is performed, using both standard radial polynomials and the radial basis functions (RBF). Our claim is that the correct approach in the case of highly irregular corneas should combine several bases. Methods. Standard approaches of reconstruction by Zernike and other types of radial polynomials are compared with the discrete least squares fit (LSF) by the RBF in three theoretical surfaces, synthetically generated by computer algorithms in the lack of measurement noise. For the reconstruction by polynomials the maximal radial order 6 was chosen, which corresponds to the first 28 Zernike polynomials or the first 49 Bhatia-Wolf polynomials. The fit with the RBF has been carried out using a regular grid of centers. Results. The quality of fit was assessed by computing for each surface the mean square errors (MSE) of the reconstruction by LSF, measured at the same nodes where the heights were collected. Another criterion of the fitting quality used was the accuracy in recovery of the Zernike coefficients, especially in the case of incomplete data. Conclusions. The Zernike (and especially, the Bhatia-Wolf) polynomials constitute a reliable reconstruction method of a non-severely aberrated surface with a small surface regularity index (SRI). However, they fail to capture small deformations of the anterior surface of a synthetic cornea. The most promising is a combined approach that balances the robustness of the Zernike fit with the localization of the RBF

Bivariate Krawtchouk polynomials: Inversion and connection problems with the NAVIMA algorithm

In this paper we present a recurrent procedure to solve an inversion problem for monic bivariate Krawtchouk polynomials written in vector column form, giving its solution explicitly. As a by-product, a general connection problem between two vector column of monic bivariate Krawtchouk families is also explicitly solved. Moreover, in the non monic case and also for Krawtchouk families, several expansion formulas are given, but for polynomials written in scalar form